High-degree splines from discrete Fourier transforms: Robust methods to obtain the boundary conditions
نویسندگان
چکیده
Computing accurate splines of degree greater than three is still a challenging task in today's applications. In this type interpolation, high-order derivatives are needed on the given mesh. As these rarely known and often not easy to approximate accurately, high-degree difficult obtain using standard approaches. Beaudoin (1998), Beauchemin (2003), Pepin et al. (2019), new method compute spline approximations low or high from equidistant interpolation nodes based discrete Fourier transform analyzed. The accuracy greatly depends boundary conditions. An algorithm for computation conditions can be found (2003). However, lacks robustness since approximation strongly dependant choice θ arbitrary parameters, being spline. goal paper therefore propose two robust algorithms, independent order any degree. Numerical results will presented show efficiency
منابع مشابه
Discrete Morse Functions from Fourier Transforms
A discrete Morse function for a simplicial complex describes how to construct a homotopy equivalent CW-complex with hopefully fewer cells. We associate a boolean function with the simplicial complex and construct a discrete Morse function using its Fourier transform. Methods from theoretical computer science by O’Donnell, Saks, Schramm, and Servedio, together with experimental data on complexes...
متن کاملMoments and Fourier transforms of B-splines
The problem o f determining the moments and the Fourier transforms o f B-splines with arbitrary knots is considered. There exists a simple connect ion between the moments o f such splines and the so-called extended Stirling numbers o f the second kind which are defined in section 2. Some recurrence relations for the moments o f B-splines with arbitrary knots are given in section 3. In the case ...
متن کاملFast transforms for high order boundary conditions
We study strategies for increasing the precision in the blurring models by maintaining a complexity in the related numerical linear algebra procedures (matrixvector product, linear system solution, computation of eigenvalues etc.) of the same order of the celebrated Fast Fourier Transform. The key idea is the choice of a suitable functional basis for representing signals and images. Starting fr...
متن کاملDiscrete–time Fourier Series and Fourier Transforms
We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...
متن کاملDiscrete–time Fourier Series and Fourier Transforms
We now start considering discrete–time signals. A discrete–time signal is a function (real or complex valued) whose argument runs over the integers, rather than over the real line. We shall use square brackets, as in x[n], for discrete–time signals and round parentheses, as in x(t), for continuous–time signals. This is the notation used in EECE 359 and EECE 369. Discrete–time signals arise in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 2022
ISSN: ['1873-5460', '0168-9274']
DOI: https://doi.org/10.1016/j.apnum.2022.07.006